Cyclic flows, Markov process and stochastic traffic assignment
نویسندگان
چکیده
منابع مشابه
Asymmetric Problems and Stochastic Process Models of Traffic Assignment
There is a spectrum of asymmetric assignment problems to which existing results on uniqueness of equilibrium do not apply. Moreover, multiple equilibria may be seen to exist in a number of simple examples of real-life phenomena, including interactions at priority junctions, responsive traffic signals, multiple user classes, and multi-modal choices. In contrast, recent asymptotic results on the ...
متن کاملOn Calibration and Application of Logit-Based Stochastic Traffic Assignment Models
There is a growing recognition that discrete choice models are capable of providing a more realistic picture of route choice behavior. In particular, influential factors other than travel time that are found to affect the choice of route trigger the application of random utility models in the route choice literature. This paper focuses on path-based, logit-type stochastic route choice models, i...
متن کاملTask Assignment Based on Prioritising Traffic Flows
We consider the issue of task assignment in a distributed system under heavy-tailed (ie. highly variable) workloads. A new adaptable approach called TAPTF (Task Assignment based on Prioritising Traffic Flows) is proposed, which improves performance under heavy-tailed workloads for certain classes of traffic. TAPTF controls the influx of tasks to each host, enables service differentiation throug...
متن کاملCyclic Markov equilibria in stochastic games
We examine a three-person stochastic game where the only existing equi-libria consist of cyclic Markov strategies. Unlike in two-person games of a similar type, stationary "-equilibria (" > 0) do not exist for this game. Besides we characterize the set of feasible equilibrium rewards.
متن کاملA Markov Process on Cyclic Words
The TASEP (totally asymmetric simple exclusion process) studied here is a Markov chain on cyclic words over the alphabet {1, 2, . . . , n} given by at each time step sorting an adjacent pair of letters chosen uniformly at random. For example, from the word 3124 one may go to 1324, 3124, 3124, 4123 by sorting the pair 31, 12, 24, or 43. Two words have the same type if they are permutations of ea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part B: Methodological
سال: 1996
ISSN: 0191-2615
DOI: 10.1016/0191-2615(96)00003-3